local dconstrain linear code imag classif tradit spm approach base bag featur bof requir nonlinear classifi achiev good imag classif perform paper present simpl effect code scheme call local constrain linear code llc place vq code tradit spm llc util local constraint project descriptor local coordin system project coordin integr max pool gener final represent linear classifi propos approach perform remark tradit nonlinear spm achiev state art perform benchmark compar spars code strategi object function llc analyt solut addit paper propos fast approxim llc method perform nearest neighbor search solv constrain squar fit problem bear comput complex larg codebook system process multipl frame effici significantli add practic valu llc real applic supervis translat dinvari spars code effici highli dcomplet spars code mixtur model abstract spars code sensori data recent attract notabl attent research learn featur unlabel data empir studi show map data significantli higherdimension space spars code lead superior classif perform computation challeng learn set highli complet dictionari base encod test data learn base paper describ mixtur spars code model produc high dimension spars represent effici comput advantag model effect encourag data similar enjoi similar spars represent propos model regard approxim recent propos local coordin code lcc state spars code approxim learn nonlinear manifold sensori data local linear manner featur learn mixtur spars code model work pretti linear classifi appli propos model pascal voc dataset classif task achiev stateof art perform kei word spars code highli complet dictionari train mixtur model mixtur spars code imag classif pascal voc challeng predict facial beauti landmark abstract fundament task artifici intellig comput vision build machin behav human recogn broad rang visual concept paper aim investig develop intellig system learn concept femal facial beauti produc human predictor artist social scientist long fascin notion facial beauti studi comput scientist begun year work notabl previou work aspect focu fulli automat learn approach requir costli manual annot landmark facial featur simpli raw pixel input studi base collect data order magnitud larger previou studi impos restrict term pose light background express ag ethnic face imag train test factor significantli increas difficulti learn task show biolog inspir model multipl layer trainabl featur extractor produc result human previous eigenfac approach final develop visual method interpret learn model reveal exist beauti featur current averag symmetri hypothes word dlevel emphasi model hmm dbase speech synthesi express speech synthesi recent attract great interest word level emphasi import form express distinguish focu utter comput system expect user previou work emphasi synthesi requir emphat data collect specif task paper statist approach model extract word level emphasi pattern natur speech investig hmm base speech synthesi framework compar emphat speech collect specif task cue emphasi natur speech weaker heavili affect suprasegment featur decis tree cluster approach pass factor decis tree propos effect address problem experi show approach convei emphasi significantli tradit decis tree cluster hmm adapt pass decis tree approach outperform factor decis tree approach emphasi synthesi test led significantli natur achiev balanc index term hmm base synthesi express speech synthesi decis tree improv local coordin code local tangent local coordin code lcc introduc yu al high dimension nonlinear learn method explicitli take advantag geometr structur data success win system year pascal imag classif challeng everingham show abil integr geometr inform critic real world machin learn applic paper develop idea integr geometri machin learn extend origin lcc method includ local tangent direct correct term lead approxim high dimension nonlinear function underli data manifold local flat method significantli reduc number anchor point need lcc reduc comput cost improv predict perform experi includ demonstr method effect origin lcc method imag classif task convolut neural network human action recognit fulli autom recognit action uncontrol environ exist work reli domain knowledg construct complex handcraft featur input addit environ assum control convolut neural network cnn type deep model act directli raw input autom process featur construct model limit handl input paper develop cnn model action recognit model extract featur spatial tempor dimens perform convolut captur motion inform encod multipl adjac frame develop model gener multipl channel inform input frame final featur represent obtain combin inform channel appli develop model recogn human action real world environ achiev superior perform reli handcraft featur chines calligraphi specif style render system hidden inform state model practic framework pomdp dbase spoken dialogu manag comput speech languag xxx xxx xxx comput speech languag www elsevi locat csl featur select gene express model dbase entropi abstract gene express data larg number gene small number sampl featur select gene express data aim find set gene discrimin biolog sampl type machin learn techniqu tradit gene select base empir mutual inform suffer data spars issu due small number sampl overcom spars issu propos model base approach estim entropi class variabl model data multivari normal distribut fit data multivari normal distribut maximum entropi real valu distribut standard deviat wide approxim distribut data follow multivari normal distribut condit distribut class variabl select featur normal distribut entropi comput log determin covari matrix larg number gene comput log determin effici propos algorithm larg reduc comput cost experi gene dataset comparison approach show accuraci multivari gaussian gener model featur select effici algorithm unsupervis train direct manual transcript lvcsr perform analysi larg cdma random access system retransmiss divers fade channel program sift select properti drelat function languag dbase static analysi lazi symbol evalu path constraint solut linear spatial pyramid match spars code imag classif recent svm spatial pyramid match spm kernel highli success imag classif popular nonlinear svm complex train test train size impli nontrivi scaleup algorithm handl thousand train imag paper develop extens spm method gener vector quantiz spars code multi scale spatial max pool propos linear spm kernel base sift spars code approach remark reduc complex svm train constant test number imag categor experi find term classif accuraci suggest linear spm base spars code sift descriptor significantli outperform linear spm kernel histogram nonlinear spm kernel lead state art perform benchmark singl type descriptor probablist model unvoic region hmm base speech synthesi hmm base synthesi attract great interest due compact flexibl model spectral prosod paramet approach short term spectra fundament frequenc durat simultan model multi stream hmm valu unvoic region consid undefin difficult standard hmm model prefer solut multi space distribut hmm msdhmm discret distribut model voic unvoic decis continu gaussian distribut model valu voic region assumpt undefin unvoic region special structur msdhmm lead limit accur model pattern paper altern explor unvoic valu assum exist model standard hmm framework global ti distribut gtd subject evalu show regular hmm gtd produc signific improv natur synthesis speech compar msdhmm method insensit exact method unvoic gener index term hmm base synthesi model spoken languag understand unalign data discrimin classif model data driven method spoken languag understand reduc mainten portabl cost compar handcraft parser collect word level semant annot train remain time consum task recent line research focus build gener model unalign semant represent expect maximis techniqu align semant concept paper present effici simpl techniqu pars semant tree recurs call discrimin semant classif model result show outperform exist gener model perform close complex grammar induct techniqu show method robust speech recognit error improv handcraft parser previous dialogu data collect index term semant analysi spoken dialogu system spoken languag understand larg dscale collabor predict nonparametr random effect model nonparametr model introduc multipl relat regress task input common data space tradit transfer learn model inappropri depend output fulli resolv inputspecif task specif predictor propos model treat output respons condition independ predictor unobserv random effect model nonparametr sens dimension random effect priori determin data approach estim model present em algorithm effici larg scale collabor predict problem obtain predict accuraci competit state art result tutori summari learn depend respons variabl style dconsist calligraphi synthesi system digit librari style dconsist calligraphi synthesi system digit librari dnearest neighbor mont dcarlo control algorithm pomdp dbase dialogu system real world applic model dialogu pomdp requir summari space dialogu state represent ensur tractabl optim estim function govern select system respons obtain grid base approach belief space work mont carlo control techniqu extend reduc train fit improv robust semant nois user input techniqu databas belief vector prototyp choos optim system action local weight nearest neighbor scheme introduc smooth decis process interpol function result higher user simul perform fast nonparametr matrix factor larg dscale collabor filter sheer growth onlin user data challeng develop prefer learn algorithm suffici flexibl model afford comput paper develop nonparametr matrix factor method allow latent factor low rank matrix factor method singular decomposit svd probabilist princip compon analysi ppca data driven dimension increas data size show formul nonparametr model similar optim share similar procedur compar tradit parametr low rank method nonparametr model appeal flexibl model complex data depend model advantag comput price highli challeng scale larg scale problem hamper applic applic collabor filter paper introduc optim algorithm simpl implement learn nonparametr matrix factor model highli effici larg scale problem experi eachmovi netflix largest public benchmark date demonstr nonparametr model make accur predict user rate computation compar faster train comparison previou state art parametr matrix factor model perform larg cdma random access system retransmiss divers fade channel relai daid multipl antenna transmiss wireless backhaul applic high data rate relai transmiss multipl antenna train hierarch feed dforward visual recognit model transfer learn pseudo dtask abstract build visual recognit model adapt domain challeng task comput vision featur learn machin form hierarchi feed forward model convolut neural network show promis direct difficult train train exampl paper present framework train hierarch feed forward model visual recognit transfer learn pseudo task pseudo task automat construct data supervis compris set simpl pattern match oper show pseudo task induc inform invers wishart prior function behavior network offer effect incorpor prior knowledg network train addit extrem simpl implement adapt domain extra tune approach achiev promis result challeng visual recognit task includ object recognit gender recognit ethnic recognit visual knowledg reason type categor structur unsupervis discrimin adapt discrimin map transform commonli approach speaker adapt base linear transform robustli estim limit adapt data signific gain obtain discrimin criteria train acoust model maximum likelihood ml estim transform unsupervis adapt discrimin train transform highli sensit error adapt hypothesi paper describ framework estim transform discrimin natur sensit hypothesi issu discrimin speaker independ map transform estim train transform obtain speaker specif ml estim transform appli recognit ml speaker specif transform found speaker independ discrimin map transform appli transform discrimin natur indirectli estim whilst requir ml speaker specif transform found recognit scheme evalu english convers telephon speech task significantli outperform standard ml discrimin train transform index term speaker adapt discrimin train categor match method process high ddimension emerg knowledg structur categor link grammar knowledg piec gener emerg decis dmake support deep learn kernel regular visual recognit paper aim train deep neural network rapid visual recognit task highli challeng larg due lack meaning regular function realiz network propos regular method take advantag kernel method kernel function repres prior knowledg recognit task interest deriv effici algorithm stochast gradient descent demonstr encourag result wide rang recognit task term accuraci speed stochast relat model larg dscale dyadic data mcmc stochast relat model srm provid rich famili choic learn predict dyadic data set entiti model gener matrix factor supervis learn problem util attribut entiti hierarch bayesian framework previous variat bay infer appli srm scalabl size entiti set grow ten thousand paper introduc markov chain mont carlo mcmc algorithm equival model srm order scale comput larg dyadic data set superior scalabl predict accuraci demonstr collabor filter problem involv ten thousand user half million item stochast relat model stochast relat model srm gener gaussian process gp model relat domain observ dyadic datum index pair entiti model dyadic data multipl interact gaussian process prior combin mimo relai gain highli effici wireless backhaul trnon dgreedi activ learn text categor convex ansduct experiment design surveil event detect develop evalu gener system event detect system simpl brute forc search method space time locat video evalu binari decis rule event system build top head tracker avoid costli brute forc search decis stage combin state art featur extractor classifi system probabilist framework observ pose peopl estim determin presenc event final introduc ad hoc method design specif detect opposingflow takepictur event result promis good result event categori event gain valuabl insight experi learn multipl graph document recommend web offer rich relat data semant paper address problem document recommend digit librari document question network citat entiti relat due sparsiti singl graph nois graph construct propos method combin multipl graph measur document similar factor strategi base natur graph method seek singl low dimension embed document captur rel similar latent space base obtain embed recommend framework develop semisupervis learn graph addit address scalabl issu propos increment algorithm increment method significantli improv effici calcul embed incom document batch increment method evalu real world dataset prepar cites experi demonstr signific qualiti improv batch method signific effici improv toler qualiti loss increment method dword vocabulari hearsai ii system develop darpa sponsor year speech understand research program repres specif solut speech understand problem gener framework coordin independ process achiev cooper problem solv behavior comput problem speech understand reflect larg number intrins interest issu spoken sound achiev long chain success transform intent semantm syntact structurmg eventu result audibl acoust wave consequ interpret speech mean effect invert transform recov speaker intent sound step interpret process ambigu uncertainti aris hearsai ii problem solv framework reconstruct intent hypothetm interpret formul level abstract additmn alloc hmlted process resourc fwst promis increment action final configur hearsai ii system compris problem solv compon gener evalu speech hypothes focu control mechan identifi local learn project paper present local learn project llp approach linear dimension reduct point princip compon analysi pca essenti seek project minim global estim error propos dimension reduct algorithm lead project minim local estim error elucid advantag classif task llp local inform sens project point estim base neighbor project valu experiment result provid valid effect propos algorithm robust multi dtask learn dprocess current multi task learn framework ignor robust issu mean presenc outlier task greatli reduc system perform introduc robust framework bayesian multitask learn process tp gener gaussian process gp multi task learn tp system effect distinguish good task noisi outlier task experi show tp improv system perform serv indic inform task fast infer infinit hidden relat model gaussian process model link analysi transfer learn combin content link classif matrix factor world wide web rich textual content interconnect complex hyperlink huge databas violat assumpt held convent statist method web page consid independ ident sampl difficult appli tradit mine learn method solv web mine problem web page classif exploit content link structur research direct recent receiv consider attent earli stage method exploit link structur content inform combin author inform content inform decompos link structur hub author featur appli addit document featur practic attract great simplic paper aim design algorithm exploit content linkag inform carri joint factor linkag adjac matrix document term matrix deriv represent web page low dimension factor space explicitli separ content hub author factor analysi perform base compact represent web page experi propos method compar state art method demonstr excel accuraci hypertext classif webkb cora benchmark bayesian adapt infer adapt train abstract larg vocabulari speech recognit system built found data broadcast new contrast carefulli collect data found data multipl acoust condit speaker environment nois adapt train power approach build system data transform repres acoust condit canon model train set transform paper describ bayesian framework adapt train infer framework address limit standard maximum likelihood approach contrast standard approach adapt train system directli unsupervis infer reli initi hypothes present addit limit adapt data robust recognit perform obtain limit data problem occur test control amount adapt data contrast adapt train control system complex reflect data standard point estim integr bayesian adapt infer intract margin approxim includ variat bay approxim batch increment mode adapt infer discuss approach appli adapt train maximum likelihood linear regress evalu larg vocabulari speech recognit task bayesian adapt infer shown significantli outperform standard approach index term adapt train bayesian adapt bayesian infer increment variat bay variat bayesian dirichlet dmultinomi alloc exponenti famili mixtur abstract paper studi bayesian framework densiti model mixtur exponenti famili distribut variat bayesian dirichlet multinomi alloc vbdma introduc perform infer learn effici variat bayesian method perform automat model select model close relat dirichlet process mixtur model demonstr similar automat model select variat bayesian context activ learn transduct experiment design paper consid problem select inform experi measur learn regress model propos simpl concept activ learn transduct experiment design explor unmeasur experi unlabel data scalabl comparison classic experiment design method depth analysi show method favor experi side hardto predict side repres rest experi effici optim design problem achiev altern optim sequenti greedi search extens experiment result synthet problem real world task includ questionnair design prefer learn activ learn text categor spatial sensor placement highlight advantag propos approach collabor ordin regress ordin regress effect learn user prefer research focus singl regress problem paper introduc collabor ordin regress multipl ordin regress task handl simultan model task individu explor depend rank function hierarch bayesian model assign common gaussian process gp prior individu function empir studi show collabor model outperform individu counterpart prefer learn applic supervis probabilist princip compon analysi princip compon analysi pca extens appli data mine pattern recognit inform retriev unsupervis dimension reduct label data classif regress task pca inform problem interest part input data label semi supervis set paper propos supervis pca model call sppca semi supervis pca model call ppca extens probabilist pca model propos model incorpor label inform project phase natur handl multipl output multi task learn problem deriv effici em learn algorithm model provid theoret justif model behavior sppca ppca compar supervis project method learn task show promis perform good scalabl stochast relat model discrimin link predict introduc gaussian process gp framework stochast relat model srm learn social physic relat phenomena interact entiti observ kei idea model stochast structur entiti relationship link tensor interact multipl gp defin type entiti model fact defin set nonparametr prior infinit dimension tensor matric element repres relationship tupl entiti maxim margin likelihood inform exchang particip gp entir relat network depend structur link messag depend entiti reflect adapt gp kernel framework offer discrimin approach link predict predict exist strength type relationship base partial observ linkag network attribut entiti discuss properti variant srm deriv effici learn algorithm encourag experiment result achiev toi problem user movi prefer link predict task end discuss extens srm gener relat learn task infinit hidden relat model multi doutput regular featur project discrimin cluster adapt train abstract multipl cluster scheme cluster adapt train cat eigenvoic system popular approach rapid speaker environ adapt interpol weight transform multipl cluster canon model standard hidden markov model hmm set repres individu speaker acoust environ maximum likelihood train cat previous investig state art larg vocabulari continu speech recognit system discrimin train commonli emploi paper investig appli discrimin train multipl cluster system minimum phone error mpe updat formula cat system deriv order mpe case modif standard mpe smooth function prior distribut mpe train requir complex adapt train scheme combin interpol weight linear transform structur transform st discuss mpe train framework discrimin train cat st system evalu state art convers telephon speech task multipl cluster system found outperform standard adapt train system index term cluster adapt train cat discrimin train eigenvoic minimum phone error mpe multipl cluster hmm multi doutput regular project hierarchi dregular latent semant index dirichlet enhanc relat learn appli nonparametr hierarch bayesian model relat learn hierarch bayesian approach model paramet person own entiti relationship coupl common prior distribut flexibl ad nonparametr hierarch bayesian approach learn knowledg truthfulli repres appli approach medic domain form nonparametr hierarch bayesian model relat involv hospit patient procedur diagnosi experi show addit flexibl nonparametr hierarch bay approach result accur model depend procedur diagnosi significantli improv estim probabl futur procedur learn gaussian process multipl task problem multi task learn learn multipl relat function approach base hierarch bayesian framework exploit equival parametr linear model nonparametr gaussian process gp result model learn easili em algorithm empir studi multi label text categor suggest present model accur solut multi task problem soft cluster graph propos simpl cluster framework graph encod pairwis data similar unlik usual similar base method approach softli assign data cluster probabilist importantli hierarch cluster natur deriv framework gradual merg lower level cluster higher level random walk analysi algorithm expos cluster structur resolut higher level statist model longer term diffus graph discov global cluster structur final provid encourag experiment result probabilist cluster dproject model discret data abstract discret occurr data document word calcul optim project cluster relat task goal project find low dimension latent space word cluster aim group document base featur represent gener project cluster studi independ repres intrins structur data reinforc paper introduc probabilist cluster project pcp model discret data repres unifi framework cluster perform project space project explicitli consid cluster structur iter oper turn variat em algorithm bayesian model infer guarante improv data likelihood model evalu text data set show encourag result multi dlabel inform latent semant index canon correl analysi cca techniqu model depend set variabl build recent suggest probabilist interpret cca propos nonparametr fulli bayesian framework automat select number correl compon effect captur sparsiti underli project addit partial label data algorithm semi supervis dimension reduct techniqu appli learn predict featur context learn set relat task experiment result demonstr efficaci propos approach cca stand problem appli multi label predict mimo channel capac model issu measur indoor radio channel ghz recent year multipl input multipl output mimo system promis provid high data rate environ sucient scatter exploit spatial domain design real mimo wireless system predict perform circumst accur mimo wireless channel model dierent scenario thesi present dierent model indoor mimo radio propag channel base ghz indoor mimo channel measur heterogen data fusion probabilist latent dvariabl model abstract pervas comput environ face problem handl heterogen data sourc transmit heterogen channel present heterogen user interfac call adapt data represent keep relev inform keep represent small typic gather data high dimension vector type attribut continu binari categor data paper present step probabilist latent variabl model capabl fuse high dimension heterogen data unifi low dimension continu space bring great benefit multivari data analysi visual dimension reduct adopt variat approxim likelihood observ data describ em algorithm fit model advantag propos model illustr toi data real world paint imag data visual recommend measur semant relat web site cluster local context dirichlet enhanc latent semant analysi paper describ nonparametr bayesian treatment analyz record occurr item introduc model retain strength previou approach explor latent factor record topic document uncov cluster structur record reflect statist depend latent factor nonparametr model induc dirichlet process dp flexibl adapt model complex reveal cluster structur data avoid problem deal infinit dimens replac dp prior simpler altern dirichlet multinomi alloc dma maintain main model properti dp reli markov chain mont carlo mcmc infer paper appli effici variat infer base dma propos approach yield encourag empir result toi problem text data result show propos algorithm uncov latent factor cluster structur learn gaussian process kernel hierarch bay present method learn gaussian process regress hierarch bayesian framework step kernel matric fix set input point learn data simpl effici em algorithm step nonparametr requir parametr form covari function step kernel function fit approxim learn covari matrix gener nystr method result complex data driven kernel evalu approach recommend engin art imag propos hierarch bayesian method lead excel predict perform nonparametr hierarch bayesian framework inform filter inform filter made consider progress recent year predomin approach content base method collabor method research larg concentr approach principl unifi framework lack paper suggest approach combin hierarch bayesian framework individu content base user profil gener collabor user model achiev common learn prior distribut turn parametr distribut gaussian restrict describ common learn prior distribut introduc nonparametr common prior sampl gener dirichlet process assum role hyper prior describ ectiv mean learn nonparametr distribut appli learn user inform result algorithm simpl understand offer principl solut combin content base filter collabor filter framework interpret exist techniqu unifi point view final demonstr empir success propos inform filter method probabilist memori dbase collabor filter memori base collabor filter cf studi extens literatur proven success type person recommend system paper develop probabilist framework memori base cf pmcf framework clear link classic memori base cf find principl solut problem cf base recommend system show probabilist activ learn method activ queri user solv user problem probabilist framework reduc comput cost memori base cf work carefulli select subset user profil retain high accuraci report experiment result base real world data set demonstr propos pmcf framework accur effici predict user prefer know tree forest art imag retriev societi profil paper aim address problem art imag retriev air aim user find favorit paint imag air great interest applic potenti interest research challeng retriev base paint content style heavili base user prefer profil paper describ collabor ensembl learn statist learn approach task appli probabilist support vector machin svm model individu user profil base exampl dislik paint due high complex profil model svm weak predict prefer paint overcom problem combin societi user profil repres respect svm model predict user prefer paint imag demonstr combin scheme embed bayesian framework retain intuit interpret mind user share similar prefer report extens empir studi base experiment set includ control simul perform paint imag set report evalu base user prefer collect onlin web base survei experi demonstr propos approach achiev excel perform term captur user divers prefer hybrid relev dfeedback approach text retriev relev feedback rf ectiv queri modif approach improv perform inform retriev ir interact user set document relev queri concept convent rf algorithm converg slowli cost user addit ort read irrelev document paper survei rf algorithm introduc hybrid rf approach support vector machin hrfsvm activ select uncertain document relev user feedback effici rank document natur user brows conduct experi reuter dataset track precis function feedback iter experiment result shown hrfsvm significantli outperform rf algorithm repres sampl text classif support vector machin abstract order reduc human effort increas interest appli activ learn train text classifi paper describ straightforward activ learn heurist repres sampl explor cluster structur uncertain document identifi repres sampl queri user opinion purpos speed converg support vector machin svm classifi compar activ learn algorithm propos repres sampl explicitli address problem select unlabel document empir studi compar repres sampl random sampl svm activ learn result demonstr repres sampl offer excel learn perform fewer label document reduc human effort text classif task introduct nonparametr hierarch bayesian model focu multi dagent learn collabor ensembl learn combin collabor content dbase inform filter hierarch bay collabor filter cf contentbas filter cbf wide inform filter applic approach individu strength weak paper propos probabilist framework unifi cf cbf name collabor ensembl learn base content base probabilist model user prefer cbf idea combin societi user prefer predict activ user prefer cf idea retain intuit explan combin scheme interpret hierarch bayesian approach common prior distribut learn relat experi requir global train stage increment incorpor data report result base data set reuter text data set data base user opionion art imag data set collabor ensembl achiev excel perform term recommend accuraci addit recommend engin collabor ensembl learn applic problem typic solv classic hierarch bay multisensor fusion multitask learn featur weight instanc select collabor filter inform dtheoret approach remov redund inconsist memori dbase collabor filter applic rang memori base collabor filter cf limit due cf high memori consumpt long runtim approach present paper remov redund inconsist instanc user data work show satisfactori accuraci achiev small portion origin data set allevi storag runtim cost cf algorithm approach instanc select problem select inform data increas posteriori probabl optim model evalu empir perform approach realworld data set attain promis result data size predict time significantli reduc predict accuraci par result achiev complet databas instanc select techniqu memori dbase collabor filter abstract collabor filter cf import data mine techniqu make person recommend book web page movi popular algorithm memori base collabor filter predict user prefer base similar user instanc databas tremend growth user larg number product memori base cf algorithm result problem decid instanc predict order reduc execut cost excess storag possibl improv gener accuraci avoid nois overfit paper focu work typic user prefer databas miss valu propos instanc reduct techniqu call turf turf preprocess step improv effici accuraci memori base cf algorithm kei idea gener predict carefulli select set relev instanc evalu techniqu eachmovi data set experi show propos algorithm dramat speed predict improv accuraci model mimo propag channel review paper review recent publish result multipl input multipl output mimo channel model narrowband wideband model consid distinguish main approach mimo channel model physic base physic base model physic model primarili reli statist characterist mimo channel obtain measur data physic model describ mimo channel distribut physic paramet briefli review mimo channel model discuss relationship interest aspect detail note area result select relev instanc effici accur collabor filter collabor filter databas consum prefer make person product recommend achiev widespread success commerc inform filter applic nowadai tradit collabor filter algorithm scale grow number consum qualiti recommend improv order gain trust consum paper present method improv scalabl accuraci collabor filter algorithm introduc inform theoret approach measur relev consum instanc predict prefer product target concept propos method reduc train data set select highli relev instanc experiment evalu eachmovi data set show method doesn significantli speed predict result accuraci featur weight method improv accuraci collabor filter invit address 